Computational-Complexity of Arithmetical Sentences
نویسندگان
چکیده
منابع مشابه
Computational Complexity of Multi-quantifier Sentences
We study the computational complexity of polyadic quantifiers in natural language. This type of quantification is widely used in formal semantics to model the meaning of multi-quantifier sentences. First, we show that the standard semantic constructions that turn simple quantifiers into complex ones, namely Boolean operations, iteration, cumulation, and resumption, are tractable. Then, we provi...
متن کاملArithmetical Proof and Open Sentences
If the concept of proof (including arithmetic proof) is syntactically restricted to closed sentences (or their Gödel numbers), then the standard accounts of Gödel’s Incompleteness Theorems (and Löb’s Theorem) are blocked. In these standard accounts (Gödel’s own paper and the exposition in Boolos’ Computability and Logic are treated as exemplars), it is assumed that certain formulas (notably so ...
متن کاملSequences of low arithmetical complexity
Arithmetical complexity of a sequence is the number of words of length n that can be extracted from it according to arithmetic progressions. We study uniformly recurrent words of low arithmetical complexity and describe the family of such words having lowest complexity. Mathematics Subject Classification. 68R15.
متن کاملThe Computational Content of Arithmetical Proofs
For any extension T of IΣ1 having a cut-elimination property extending that of IΣ1, the number of different proofs that can be obtained by cut-elimination from a single T -proof cannot be bound by a function which is provably total in T .
متن کاملOn possible growths of arithmetical complexity
The arithmetical complexity of infinite words, defined by Avgustinovich, Fon-Der-Flaass and the author in 2000, is the number of words of length n which occur in the arithmetical subsequences of the infinite word. This is one of the modifications of the classical function of subword complexity, which is equal to the number of factors of the infinite word of length n. In this paper, we show that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1995
ISSN: 0890-5401
DOI: 10.1006/inco.1995.1116